var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(LatticeChan|LatticeSrc)&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(LatticeChan|LatticeSrc)&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(LatticeChan|LatticeSrc)&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2011\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Mohajer; S N. Diggavi; C. Fragouli; and D. Tse.\n\n\n \n \n \n \n \n Approximate capacity region for a class of relay-interference networks.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 57(5): 2837-2864. May 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Approximate arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{MDFTj10,\n abstract = {In this paper we study  two-stage Gaussian \nrelay-interference networks where there are weak cross-links, causing the networks to behave like a chain\nof Z Gaussian channels. Our main result is an approximate characterization of the capacity region for  such networks. We propose a new interference management scheme, termed interference\nneutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air\ninterference removal, without the transmitters having complete access the interfering signals.},\n author = {S. Mohajer and S N. Diggavi and C. Fragouli and D. Tse},\n file = {:papers:relayinterference_revised.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {mdft_js10},\n month = {May},\n note = {},\n number = {5},\n pages = {2837-2864},\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\n title = {Approximate capacity region for a class of relay-interference networks},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/1005.0404},\n volume = {57},\n year = {2011}\n}\n\n
\n
\n\n\n
\n In this paper we study two-stage Gaussian relay-interference networks where there are weak cross-links, causing the networks to behave like a chain of Z Gaussian channels. Our main result is an approximate characterization of the capacity region for such networks. We propose a new interference management scheme, termed interference neutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air interference removal, without the transmitters having complete access the interfering signals.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n A. Ozgur; and S N. Diggavi.\n\n\n \n \n \n \n \n Approximately achieving Gaussian relay network capacity with lattice codes.\n \n \n \n \n\n\n \n\n\n\n In Proc. of IEEE ISIT 2010, Austin, Texas, pages 669–673, June 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Approximately arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{ODp10,\n abstract = {An approximate max-flow min-cut result for arbitrary wireless relay\nnetwork was recently established using Gaussian codebooks for\ntransmission and random mappings at the relays. In this paper,\nwe show that the approximation result can be established\nby using lattices for transmission and quantization along with\nstructured mappings at the relays. This also extended the original scalar quantizer\nanalysis to vector quantizers and obtained a slightly better approximation constant.},\n author = {A. Ozgur and S N. Diggavi},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n file = {:papers:od_isit10.pdf},\n month = {June},\n note = {},\n pages = {669--673},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},\n title = {Approximately achieving Gaussian relay network capacity with lattice codes},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1005.1284},\n year = {2010}\n}\n\n
\n
\n\n\n
\n An approximate max-flow min-cut result for arbitrary wireless relay network was recently established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays. This also extended the original scalar quantizer analysis to vector quantizers and obtained a slightly better approximation constant.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S. Mohajer; S N. Diggavi; and D. Tse.\n\n\n \n \n \n \n Approximate Capacity of a Class of Gaussian Relay-Interference Networks.\n \n \n \n\n\n \n\n\n\n In IEEE International Symposium on Information Theory (ISIT), Seoul, Korea, pages 31–35, June 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{MDTj09,\n author = {S. Mohajer and S N. Diggavi and D. Tse},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Seoul, Korea},\n month = {June},\n note = {},\n pages = {31--35},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,RelayInt,LatticeChan},\n title = {Approximate Capacity of a Class of Gaussian Relay-Interference Networks},\n type = {4},\n year = {2009}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; N J A. Sloane; and V A. Vaishampayan.\n\n\n \n \n \n \n Asymmetric Multiple Description Lattice Vector Quantizers.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 48(1): 174–191. January 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DSVj02,\n abstract = {This designs asymmetric multiple description lattice quantizers, which covers\nthe entire range of the distortion profile, from symmetric to successive refinement. We present a solution to the labeling problem, which is an important part of the construction. We show that this construction is optimal in the high-rate regime, by comparing it to the information-theoretic bounds.},\n author = {S N. Diggavi and N J A. Sloane and V A. Vaishampayan},\n file = {:papers:ps:final_mdc.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {January},\n note = {},\n number = {1},\n pages = {174--191},\n tags = {journal,NDC,IT,MDC,LatticeSrc},\n title = {Asymmetric Multiple Description Lattice Vector Quantizers},\n type = {2},\n volume = {48},\n year = {2002}\n}\n\n
\n
\n\n\n
\n This designs asymmetric multiple description lattice quantizers, which covers the entire range of the distortion profile, from symmetric to successive refinement. We present a solution to the labeling problem, which is an important part of the construction. We show that this construction is optimal in the high-rate regime, by comparing it to the information-theoretic bounds.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; N J A. Sloane; and V. A. Vaishampayan.\n\n\n \n \n \n \n Design of Asymmetric Multiple Description Lattice Vector Quantizers.\n \n \n \n\n\n \n\n\n\n In IEEE Data Compression Conference (DCC),Snowbird, Utah, pages 490–499, March 2000. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DSVj00,\n author = {S N. Diggavi and N J A. Sloane and V. A. Vaishampayan},\n booktitle = {IEEE Data Compression Conference (DCC),Snowbird, Utah},\n month = {March},\n note = {},\n pages = {490--499},\n tags = {conf,NDC,IT,MDC,LatticeSrc},\n title = {Design of Asymmetric Multiple Description Lattice Vector Quantizers},\n type = {4},\n year = {2000}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);